C4-saturated bipartite graphs
نویسندگان
چکیده
منابع مشابه
C4-saturated bipartite graphs
Let H be a graph. A graph G is said to be H -free if it contains no subgraph isomorphic to H . A graph G is said to be an H -saturated subgraph of a graph K if G is an H -free subgraph of K with the property that for any edge e∈E(K) \ E(G); G ∪ {e} is not H -free. We present some general results on Ks; t-saturated subgraphs of the complete bipartite graph Km;n and study the problem of 3nding, f...
متن کاملKs, t-saturated bipartite graphs
An n-by-n bipartite graph is H-saturated if the addition of any missing edge between its two parts creates a new copy of H. In 1964, Erdős, Hajnal and Moon made a conjecture on the minimum number of edges in a Ks,s-saturated bipartite graph. This conjecture was proved independently by Wessel and Bollobás in a more general, but ordered, setting: they showed that the minimum number of edges in a ...
متن کاملC4–free 2-factors in bipartite graphs
D. Hartvigsen [H] recently gave an algorithm to find a C4–free 2–factor in a bipartite graph and using this algorithm he proved several nice theorems. Now we give a simple inductive proof for a generalization of his Tutte-type theorem, and prove the corresponding Ore-type theorem as well. The proof follows the idea of the inductive proof for the Hall’s theorem given by Halmos and Vaughn [HV].
متن کاملPm-saturated bipartite graphs with minimum size
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pm) of Pm-saturated graph of order n. They gave the number sat(n;Pm) for n big enough. We deal with similar problem for bipartite graphs.
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00371-0